Genome analysis with distance to the nearest dissimilar nucleotide
نویسندگان
چکیده
منابع مشابه
Genome analysis with distance to the nearest dissimilar nucleotide.
DNA may be represented by sequences of four symbols, but it is often useful to convert those symbols into real or complex numbers for further analysis. Several mapping schemes have been used in the past, but most of them seem to be unrelated to any intrinsic characteristic of DNA. The objective of this work was to study a mapping scheme that is directly related to DNA characteristics, and that ...
متن کاملGenome analysis with inter-nucleotide distances
MOTIVATION DNA sequences can be represented by sequences of four symbols, but it is often useful to convert the symbols into real or complex numbers for further analysis. Several mapping schemes have been used in the past, but they seem unrelated to any intrinsic characteristic of DNA. The objective of this work was to find a mapping scheme directly related to DNA characteristics and that would...
متن کاملBounds for the Distance to the Nearest Correlation Matrix
In a wide range of practical problems correlation matrices are formed in such a way that, while symmetry and a unit diagonal are assured, they may lack semidefiniteness. We derive a variety of new upper bounds for the distance from an arbitrary symmetric matrix to the nearest correlation matrix. The bounds are of two main classes: those based on the eigensystem and those based on a modified Cho...
متن کاملBounds for the Componentwise Distance to the Nearest Singular Matrix
The normwise distance of a matrix A to the nearest singular matrix is well known to be equal to ‖A‖/cond(A) for norms being subordinate to a vector norm. However, there is no hope to find a similar formula or even a simple algorithm for computing the componentwise distance to the nearest singular matrix for general matrices. This is because Rohn and Poljak [7] showed that this is an NP -hard pr...
متن کاملComputing the nearest Euclidean distance matrix with low embedding dimensions
Euclidean distance embedding appears in many high-profile applications including wireless sensor network localization, where not all pairwise distances among sensors are known or accurate. The classical Multi-Dimensional Scaling (cMDS) generally works well when the partial or contaminated Euclidean Distance Matrix (EDM) is close to the true EDM, but otherwise performs poorly. A natural step pre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Theoretical Biology
سال: 2011
ISSN: 0022-5193
DOI: 10.1016/j.jtbi.2011.01.038